Descriptive complexity - PDFSEARCH.IO - Document Search Engine

Descriptive complexity
Results: 93

#	Item
21	C HICAGO J OURNAL OF T HEORETICAL C OMPUTER S CIENCE 2010, Article 4, pages 1–13 http://cjtcs.cs.uchicago.edu/ S PECIAL ISSUE FOR CATSOn Process Complexity Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-02 15:57:59 Tau Computability theory Descriptive complexity Kolmogorov complexity
22	Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2013-04-27 00:54:51 Computability theory Analysis of algorithms Descriptive complexity Kolmogorov complexity Bounded-error probabilistic polynomial FO PP IP Time complexity Theoretical computer science Computational complexity theory Applied mathematics
23	BELIZE International Year of the ChildC + L ABEL Add to Reading List Source URL: www.stampalbums.com Language: English - Date: 2014-06-28 09:37:15 Mathematics FO Overprint SO HO Finite model theory Descriptive complexity Computational complexity theory
24	SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases∗ Xiaopeng Xiong Mohamed F. Mokbel Add to Reading List Source URL: www-users.cs.umn.edu Language: English - Date: 2009-09-29 10:22:41 Bin Data management Data Applied mathematics Bx-tree Descriptive complexity Query R-tree
25	THE COMPLEXITY OF CLASSIFICATION PROBLEMS IN ERGODIC THEORY ALEXANDER S. KECHRIS AND ROBIN D. TUCKER-DROB Dedicated to the memory of Greg Hjorth) Add to Reading List Source URL: www.math.rutgers.edu Language: English - Date: 2012-02-03 12:51:36 Descriptive set theory Statistics Probability theory Stochastic processes Measure theory Borel equivalence relation Borel set Ergodicity Standard probability space Mathematical analysis Mathematics Ergodic theory
26	The Ackermann Award 2011 Report of the Jury The seventh Ackermann Award will be presented at this CSL’11, held in Bergen, Norway. This is the ﬁfth year the EACSL Ackermann Award is generously sponsored. Our sponsor f Add to Reading List Source URL: eacsl.kahle.ch Language: English - Date: 2013-12-08 17:58:05 Computational complexity theory Finite model theory Circuit complexity Clique problem Clique Wilhelm Ackermann Logic Switching lemma Descriptive complexity theory Theoretical computer science Mathematics Applied mathematics
27	The Probability of “Undefined” (Non–Converging) Output in Generating the Universal Probability Distribution Ray J. Solomonoff Visiting Professor, Computer Learning Research Centre Royal Holloway, University of Lond Add to Reading List Source URL: world.std.com Language: English - Date: 2014-09-18 21:27:10 Computability theory Descriptive complexity Kolmogorov complexity Kullback–Leibler divergence Universal Turing machine Normalizing constant Theoretical computer science Statistics Applied mathematics
28	Want to store date in the smallest possible space? Use data compression! Compression for Data Structures LZ- FAMILY, Add to Reading List Source URL: yury.name Language: English - Date: 2006-10-24 14:07:00 Information retrieval Searching Computability theory Descriptive complexity Kolmogorov complexity Suffix tree Data compression Suffix array Complexity Information science Science Information
29	On the Complexity of Query Result Diversification 1 Ting Deng1 Wenfei Fan2,1 Add to Reading List Source URL: www.vldb.org Language: English - Date: 2013-06-29 06:38:52 Complexity classes Finite model theory Structural complexity theory FO Descriptive complexity Conjunctive query SO Oracle machine P Theoretical computer science Computational complexity theory Applied mathematics
30	Specula(ng Seriously Rachid Guerraoui, EPFL The World is turning IT IT is turning distributed Add to Reading List Source URL: lpdwww.epfl.ch Language: English - Date: 2010-10-12 11:08:22 Finite model theory SO Complexity Science Structure Computational complexity theory Applied mathematics Descriptive complexity